Delay-Constrained Topology-Transparent Distributed Scheduling for MANETs

Transparent topology is common in many mobile ad hoc networks (MANETs) such as vehicle (VANETs), unmanned aerial (UAV) networks, and wireless sensor due to their decentralization mobility nature. There are existing works on distributed scheduling scheme design for topology-transparent MANETs. Most of them focus delay-unconstrained settings. However, with the proliferation real-time applications over communications, it becomes more important support delay-constrained traffic In applications, each packet has a given hard deadline: if not delivered before its deadline, validity will expire be removed from system. This feature fundamentally different traditional one. this article, we first time investigate schemes MANET traffic. We analyze compare probabilistic ALOHA deterministic sequence schemes, including conventional division multiple access (TDMA), Galois field (GF) proposed by Chlamtac Faragò combination that propose special type sparse network topology. use both theoretical analysis empirical simulations all these summarize conditions under which individual perform best.